Global and Fine Approximation of Convex Functions

نویسنده

  • DANIEL AZAGRA
چکیده

Let U ⊆ R be open and convex. We prove that every (not necessarily Lipschitz or strongly) convex function f : U → R can be approximated by real analytic convex functions, uniformly on all of U . We also show that C-fine approximation of convex functions by smooth (or real analytic) convex functions on R is possible in general if and only if d = 1. Nevertheless, for d ≥ 2 we give a characterization of the class of convex functions on R which can be approximated by real analytic (or just smoother) convex functions in the C-fine topology. It turns out that the possibility of performing this kind of approximation is not determined by the degree of local convexity or smoothness of the given function, but by its global geometrical behaviour. We also show that every C convex and proper function on U can be approximated by C∞ convex functions in the C-fine topology, and we provide some applications of these results, concerning prescription of (sub-)differential boundary data to convex real analytic functions, and smooth surgery of convex bodies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

SUPER- AND SUB-ADDITIVE ENVELOPES OF AGGREGATION FUNCTIONS: INTERPLAY BETWEEN LOCAL AND GLOBAL PROPERTIES, AND APPROXIMATION

Super- and sub-additive transformations of aggregation functions have been recently introduced by Greco, Mesiar, Rindone and v{S}ipeky [The superadditive and the subadditive transformations of integrals and aggregation functions, {it Fuzzy Sets and Systems} {bf 291} (2016), 40--53]. In this article we give a survey of the recent development regarding the existence of aggregation functions with ...

متن کامل

An algorithm for approximating nondominated points of convex multiobjective optimization problems

‎In this paper‎, ‎we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP)‎, ‎where the constraints and the objective functions are convex‎. ‎We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points‎. ‎The proposed algorithm can be appl...

متن کامل

Hermite-Hadamard inequalities for $mathbb{B}$-convex and $mathbb{B}^{-1}$-convex functions

Hermite-Hadamard inequality is one of the fundamental applications of convex functions in Theory of Inequality. In this paper, Hermite-Hadamard inequalities for $mathbb{B}$-convex and $mathbb{B}^{-1}$-convex functions are proven.

متن کامل

Bernstein's polynomials for convex functions and related results

In this paper we establish several polynomials similar to Bernstein's polynomials and several refinements of  Hermite-Hadamard inequality for convex functions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012